Slice Encoding for Constraint-Based Planning
نویسندگان
چکیده
In most of the constraint-based approaches to planning, the problem is unfolded over a given number of steps. Because this unfolded CSP encoding is very time and memory consuming, we propose on top of the CNT framework (Constraint Networks on Timelines) a more efficient slice CSP encoding which allows only a limited number of steps to be considered at each step of the search.
منابع مشابه
Effect of Phase-Encoding Reduction on Geometric Distortion and BOLD Signal Changes in fMRI
Introduction Echo-planar imaging (EPI) is a group of fast data acquisition methods commonly used in fMRI studies. It acquires multiple image lines in k-space after a single excitation, which leads to a very short scan time. A well-known problem with EPI is that it is more sensitive to distortions due to the used encoding scheme. Source of distortion is inhomogeneity in the static B0 field that ...
متن کاملAn improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملEncoding HTN Planning as a Dynamic CSP
Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal is an application of the CSP formalism on hierarchical task network planning domain. An encoding of HTN planning problems as a dynamic CSP is presented. We suppose that such encoding would provide a way for search space reductio...
متن کاملOn Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, pp. 75-82.) Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advanc...
متن کاملDiscretization of Temporal Models with Application to Planning with SMT
The problem of planning or discrete control for timed system has earlier been solved with various constraint-based solution methods, including Constraint Programming, SAT solvers, SAT modulo Theories solvers, and Mixed Integer-Linear Programming. In this work we investigate the encoding of time in such constraint-based representations. A main issue with existing encodings is the necessity to al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009